Extensional Isomorphisms of Inductive Types in Simply-Typed Lambda-Calculus
نویسندگان
چکیده
We study isomorphisms of types in the system of simply-typed λ-calculus with inductive types and recursion. It is shown that in some cases (multiproducts, copies of types), it is possible to add new reductions in such a way that strong normalisation and confluence of the calculus is preserved, and the isomorphisms may be regarded as intensional w.r.t. a stronger equality relation.
منابع مشابه
Monad Translating Inductive and Coinductive Types
We show that the call-by-name monad translation of simply typed lambda calculus extended with sum and product types extends to special and general inductive and coinductive types so that its crucial property of preserving typings and βand commuting reductions is maintained. Specific similar-purpose translations such as CPS translations follow from the general monad translations by specializatio...
متن کاملExtensional Rewriting with Sums
Inspired by recent work on normalisation by evaluation for sums, we propose a normalising and confluent extensional rewriting theory for the simply-typed λ-calculus extended with sum types. As a corollary of confluence we obtain decidability for the extensional equational theory of simply-typed λ-calculus extended with sum types. Unlike previous decidability results, which rely on advanced rewr...
متن کاملSimply Typed Lambda-Calculus Modulo Type Isomorphisms
We define a simply typed, non-deterministic lambda-calculus where isomorphic types are equated. To this end, an equivalence relation is settled at the term level. We then provide a proof of strong normalisation modulo equivalence. Such a proof is a non-trivial adaptation of the reducibility method.
متن کاملHigher-Order Uni cation via Combinators
We present an algorithm for uniication in the simply typed lambda calculus which enumerates complete sets of uniiers using a nitely branching search space. In fact, the types of terms may contain type-variables, so that a solution may involve type-substitution as well as term-substitution. the problem is rst translated into the problem of uniication with respect to extensional equality in combi...
متن کاملExtensional Models of Typed Lambda-mu Calculus
This paper shows that the stream models of Nakazawa and Katsumata can be adapted to a typed setting for an extension of the Λμcalculus, called Λμcons. It shows the typed Λμcons is sound and complete with respect to the stream models. It also shows that any individual stream model with whole function spaces and infinite bases characterizes the extensional equality. This result corresponds to Fri...
متن کامل